The T - join Problem in Sparse Graphs : Applications to Phase Assignment Problem
نویسندگان
چکیده
Given a graph G with weighted edges, and a subset of nodes T, the T-join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A ii u 2 T. We describe the applications of the T-join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal reenement of nite element meshes. We suggest a practical algorithm for the T-join problem. In sparse graphs, this algorithm is faster than previously known methods. Computational experience with industrial VLSI layout benchmarks shows the advantages of the new algorithm.
منابع مشابه
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
Given a graph G with weighted edges, and a subset of nodes T , the T -join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A i u 2 T . We describe the applications of the T -join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal re nement of nite element meshes. We suggest a practical algorithm ...
متن کاملOptimal Phase Con ict Removal for Layout of Dark Field Alternating Phase Shifting Masks
We describe new, e cient algorithms for layout modi cation and phase assignment for dark eld alternating-type phase-shifting masks in the single-exposure regime. We make the following contributions. First, we suggest new 2-coloring and compaction approach that simultaneously optimizes layout and phase assignment which is based on planar embedding of an associated con ict graph. We also describe...
متن کاملGraph Partitioning Algorithms with Applications to Scientific Computing Graph Partitioning Algorithms
Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a speciied number of subsets such that few edges join two vertices in diierent subsets. Several new graph partitioning al...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملLocomotive assignment problem with train precedence using genetic algorithm
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...
متن کامل